Martin Edward Dyer (born July 16, 1946 in Ryde, Isle of Wight, England) is a professor in the School of Computing at the University of Leeds, Leeds, England. He graduated from the University of Leeds in 1967, obtained his MSc from Imperial College, University of London in 1968 and his PhD from the University of Leeds in 1979. His research interests lie in theoretical computer science, discrete optimization and combinatorics. Currently, he focuses on the complexity of counting and the efficiency of Markov chain algorithms for approximate counting.
Contents |
Four key contributions made by Martin Dyer are:
(1) - polynomial time algorithm for approximating the volume of convex bodies
(2) - linear programming in fixed dimensions
(3) - the path coupling method for proving mixing of Markov chains (with Russ Bubley)
(4) - complexity of counting constraint satisfaction problems
The paper [1] is a joint work by Martin Dyer, Alan Frieze and Ravindran Kannan.
In 1991, Professor Dyer received the Fulkerson Prize in Discrete Mathematics (Jointly with Alan Frieze and Ravi Kannan for the paper "A random polynomial time algorithm for approximating the volume of convex bodies" in the Journal of the Association for Computing Machinery) awarded by the American Mathematical Society and the Mathematical Programming Society.
Martin Dyer is married to Alison. They have two adult children.